Centered Triangular Sum Labeling of Graphs
نویسندگان
چکیده
منابع مشابه
Super Pair Sum Labeling of Graphs
Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملSome Higher Order Triangular Sum Labeling of Graphs
A (p,q) graph G is said to admit n order triangular sum labeling if its vertices can be labeled by non negative integers such that the induced edge labels obtained by the sum of the labels of end vertices are the first q n order triangular numbers. A graph G which admits n order triangular sum labeling is called n order triangular sum graph. In this paper we prove that paths, combs, stars, subd...
متن کاملMinimal Sum Labeling of Graphs
A graph G is called a sum graph if there is a so-called sum labeling of G, i.e. an injective function l : V (G) → N such that for every u, v ∈ V (G) it holds that uv ∈ E(G) if and only if there exists a vertex w ∈ V (G) such that l(u) + l(v) = l(w). We say that sum labeling l is minimal if there is a vertex u ∈ V (G) such that l(u) = 1. In this paper, we show that if we relax the conditions (ei...
متن کاملedge pair sum labeling of some cycle related graphs
let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defi ned by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex v and f*(v (g)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} u {±k(p+1)/2} according a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2013
ISSN: 2249-0868
DOI: 10.5120/ijais13-450947